TSTP Solution File: SEV382^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV382^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:42:59 EDT 2024
% Result : Theorem 0.21s 0.41s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 51 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 329 ( 130 equ; 0 cnn)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 469 ( 104 ~; 57 |; 38 &; 239 @)
% ( 2 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 22 ^ 97 !; 36 ?; 156 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(func_def_7,type,
sK3: ( a > $o ) > a ).
thf(func_def_8,type,
sK4: a > a ).
thf(func_def_11,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f194,plain,
$false,
inference(avatar_sat_refutation,[],[f176,f184,f193]) ).
thf(f193,plain,
( spl5_7
| ~ spl5_10 ),
inference(avatar_split_clause,[],[f190,f173,f116]) ).
thf(f116,plain,
( spl5_7
<=> ! [X0: a] :
( ( sK1 @ X0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
thf(f173,plain,
( spl5_10
<=> ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_10])]) ).
thf(f190,plain,
( ! [X0: a] :
( ( sK1 @ X0 )
= $true )
| ~ spl5_10 ),
inference(trivial_inequality_removal,[],[f188]) ).
thf(f188,plain,
( ! [X0: a] :
( ( $false = $true )
| ( ( sK1 @ X0 )
= $true ) )
| ~ spl5_10 ),
inference(superposition,[],[f175,f27]) ).
thf(f27,plain,
! [X6: a,X9: a > $o] :
( ( ( X9
@ ( sK3
@ ^ [Y0: a] :
~ ( X9 @ Y0 ) ) )
= $false )
| ( ( X9 @ X6 )
= $true ) ),
inference(not_proxy_clausification,[],[f26]) ).
thf(f26,plain,
! [X6: a,X9: a > $o] :
( ( ( ~ ( X9
@ ( sK3
@ ^ [Y0: a] :
~ ( X9 @ Y0 ) ) ) )
= $true )
| ( ( X9 @ X6 )
= $true ) ),
inference(not_proxy_clausification,[],[f25]) ).
thf(f25,plain,
! [X6: a,X9: a > $o] :
( ( ( ~ ( X9 @ X6 ) )
!= $true )
| ( ( ~ ( X9
@ ( sK3
@ ^ [Y0: a] :
~ ( X9 @ Y0 ) ) ) )
= $true ) ),
inference(beta_eta_normalization,[],[f23]) ).
thf(f23,plain,
! [X6: a,X9: a > $o] :
( ( ( ^ [Y0: a] :
~ ( X9 @ Y0 )
@ ( sK3
@ ^ [Y0: a] :
~ ( X9 @ Y0 ) ) )
= $true )
| ( ( ^ [Y0: a] :
~ ( X9 @ Y0 )
@ X6 )
!= $true ) ),
inference(primitive_instantiation,[],[f18]) ).
thf(f18,plain,
! [X3: a > $o,X6: a] :
( ( $true
= ( X3 @ ( sK3 @ X3 ) ) )
| ( $true
!= ( X3 @ X6 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( sK1 @ sK2 )
!= $true )
& ! [X3: a > $o] :
( ( ( $true
= ( X3 @ ( sK3 @ X3 ) ) )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( sK0 @ X5 @ ( sK3 @ X3 ) )
!= $true ) ) )
| ! [X6: a] :
( $true
!= ( X3 @ X6 ) ) )
& ! [X7: a] :
( ( ( sK1 @ X7 )
= $true )
| ( ( ( sK0 @ ( sK4 @ X7 ) @ X7 )
= $true )
& ( $true
!= ( sK1 @ ( sK4 @ X7 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f9,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a > a > $o,X1: a > $o] :
( ? [X2: a] :
( ( X1 @ X2 )
!= $true )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( ( X3 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
!= $true ) ) )
| ! [X6: a] :
( $true
!= ( X3 @ X6 ) ) )
& ! [X7: a] :
( ( ( X1 @ X7 )
= $true )
| ? [X8: a] :
( ( ( X0 @ X8 @ X7 )
= $true )
& ( ( X1 @ X8 )
!= $true ) ) ) )
=> ( ? [X2: a] :
( ( sK1 @ X2 )
!= $true )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( ( X3 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( $true
!= ( sK0 @ X5 @ X4 ) ) ) )
| ! [X6: a] :
( $true
!= ( X3 @ X6 ) ) )
& ! [X7: a] :
( ( ( sK1 @ X7 )
= $true )
| ? [X8: a] :
( ( ( sK0 @ X8 @ X7 )
= $true )
& ( ( sK1 @ X8 )
!= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X2: a] :
( ( sK1 @ X2 )
!= $true )
=> ( ( sK1 @ sK2 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X3: a > $o] :
( ? [X4: a] :
( ( ( X3 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( $true
!= ( sK0 @ X5 @ X4 ) ) ) )
=> ( ( $true
= ( X3 @ ( sK3 @ X3 ) ) )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( sK0 @ X5 @ ( sK3 @ X3 ) )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
! [X7: a] :
( ? [X8: a] :
( ( ( sK0 @ X8 @ X7 )
= $true )
& ( ( sK1 @ X8 )
!= $true ) )
=> ( ( ( sK0 @ ( sK4 @ X7 ) @ X7 )
= $true )
& ( $true
!= ( sK1 @ ( sK4 @ X7 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a > a > $o,X1: a > $o] :
( ? [X2: a] :
( ( X1 @ X2 )
!= $true )
& ! [X3: a > $o] :
( ? [X4: a] :
( ( ( X3 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X3 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
!= $true ) ) )
| ! [X6: a] :
( $true
!= ( X3 @ X6 ) ) )
& ! [X7: a] :
( ( ( X1 @ X7 )
= $true )
| ? [X8: a] :
( ( ( X0 @ X8 @ X7 )
= $true )
& ( ( X1 @ X8 )
!= $true ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a > a > $o,X1: a > $o] :
( ? [X8: a] :
( ( X1 @ X8 )
!= $true )
& ! [X2: a > $o] :
( ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X2 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
!= $true ) ) )
| ! [X3: a] :
( ( X2 @ X3 )
!= $true ) )
& ! [X6: a] :
( ( ( X1 @ X6 )
= $true )
| ? [X7: a] :
( ( ( X0 @ X7 @ X6 )
= $true )
& ( ( X1 @ X7 )
!= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a > a > $o,X1: a > $o] :
( ? [X8: a] :
( ( X1 @ X8 )
!= $true )
& ! [X6: a] :
( ( ( X1 @ X6 )
= $true )
| ? [X7: a] :
( ( ( X0 @ X7 @ X6 )
= $true )
& ( ( X1 @ X7 )
!= $true ) ) )
& ! [X2: a > $o] :
( ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X2 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
!= $true ) ) )
| ! [X3: a] :
( ( X2 @ X3 )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > a > $o,X1: a > $o] :
( ( ! [X6: a] :
( ! [X7: a] :
( ( ( X0 @ X7 @ X6 )
= $true )
=> ( ( X1 @ X7 )
= $true ) )
=> ( ( X1 @ X6 )
= $true ) )
& ! [X2: a > $o] :
( ? [X3: a] :
( ( X2 @ X3 )
= $true )
=> ? [X4: a] :
( ( ( X2 @ X4 )
= $true )
& ! [X5: a] :
( ( ( X0 @ X5 @ X4 )
= $true )
=> ( ( X2 @ X5 )
!= $true ) ) ) ) )
=> ! [X8: a] :
( ( X1 @ X8 )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o,X1: a > $o] :
( ( ! [X2: a > $o] :
( ? [X3: a] :
( ( X2 @ X3 )
= $true )
=> ? [X4: a] :
( ! [X5: a] :
( ( ( X0 @ X5 @ X4 )
= $true )
=> ( ( X2 @ X5 )
!= $true ) )
& ( ( X2 @ X4 )
= $true ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( ( X0 @ X7 @ X6 )
= $true )
=> ( ( X1 @ X7 )
= $true ) )
=> ( ( X1 @ X6 )
= $true ) ) )
=> ! [X8: a] :
( ( X1 @ X8 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o,X1: a > $o] :
( ( ! [X2: a > $o] :
( ? [X3: a] : ( X2 @ X3 )
=> ? [X4: a] :
( ! [X5: a] :
( ( X0 @ X5 @ X4 )
=> ~ ( X2 @ X5 ) )
& ( X2 @ X4 ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( X0 @ X7 @ X6 )
=> ( X1 @ X7 ) )
=> ( X1 @ X6 ) ) )
=> ! [X8: a] : ( X1 @ X8 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o,X1: a > $o] :
( ( ! [X2: a > $o] :
( ? [X3: a] : ( X2 @ X3 )
=> ? [X4: a] :
( ! [X5: a] :
( ( X0 @ X5 @ X4 )
=> ~ ( X2 @ X5 ) )
& ( X2 @ X4 ) ) )
& ! [X6: a] :
( ! [X4: a] :
( ( X0 @ X4 @ X6 )
=> ( X1 @ X4 ) )
=> ( X1 @ X6 ) ) )
=> ! [X6: a] : ( X1 @ X6 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o,X1: a > $o] :
( ( ! [X2: a > $o] :
( ? [X3: a] : ( X2 @ X3 )
=> ? [X4: a] :
( ! [X5: a] :
( ( X0 @ X5 @ X4 )
=> ~ ( X2 @ X5 ) )
& ( X2 @ X4 ) ) )
& ! [X6: a] :
( ! [X4: a] :
( ( X0 @ X4 @ X6 )
=> ( X1 @ X4 ) )
=> ( X1 @ X6 ) ) )
=> ! [X6: a] : ( X1 @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.JQ538Qcd0o/Vampire---4.8_31193',cTRANS_IND) ).
thf(f175,plain,
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ~ spl5_10 ),
inference(avatar_component_clause,[],[f173]) ).
thf(f184,plain,
~ spl5_7,
inference(avatar_contradiction_clause,[],[f183]) ).
thf(f183,plain,
( $false
| ~ spl5_7 ),
inference(trivial_inequality_removal,[],[f178]) ).
thf(f178,plain,
( ( $true != $true )
| ~ spl5_7 ),
inference(superposition,[],[f19,f117]) ).
thf(f117,plain,
( ! [X0: a] :
( ( sK1 @ X0 )
= $true )
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f116]) ).
thf(f19,plain,
( ( sK1 @ sK2 )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f176,plain,
( spl5_7
| spl5_10 ),
inference(avatar_split_clause,[],[f164,f173,f116]) ).
thf(f164,plain,
! [X0: a] :
( ( ( sK1 @ X0 )
= $true )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
! [X0: a] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ( ( sK1 @ X0 )
= $true )
| ( $true != $true ) ),
inference(duplicate_literal_removal,[],[f149]) ).
thf(f149,plain,
! [X0: a] :
( ( $true != $true )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( sK1 @ Y0 ) ) )
= $true )
| ( ( sK1 @ X0 )
= $true ) ),
inference(superposition,[],[f15,f90]) ).
thf(f90,plain,
! [X1: a,X4: a > $o] :
( ( ( X4
@ ( sK4
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) ) )
= $true )
| ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) )
= $true )
| ( ( X4 @ X1 )
= $true ) ),
inference(not_proxy_clausification,[],[f89]) ).
thf(f89,plain,
! [X1: a,X4: a > $o] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) )
= $true )
| ( ( ~ ( X4 @ X1 ) )
!= $true )
| ( ( X4
@ ( sK4
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f88]) ).
thf(f88,plain,
! [X1: a,X4: a > $o] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) )
= $true )
| ( ( ~ ( X4
@ ( sK4
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) ) ) )
!= $true )
| ( ( ~ ( X4 @ X1 ) )
!= $true ) ),
inference(beta_eta_normalization,[],[f81]) ).
thf(f81,plain,
! [X1: a,X4: a > $o] :
( ( ( sK1
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) )
= $true )
| ( ( ^ [Y0: a] :
~ ( X4 @ Y0 )
@ X1 )
!= $true )
| ( ( ^ [Y0: a] :
~ ( X4 @ Y0 )
@ ( sK4
@ ( sK3
@ ^ [Y0: a] :
~ ( X4 @ Y0 ) ) ) )
!= $true ) ),
inference(primitive_instantiation,[],[f37]) ).
thf(f37,plain,
! [X0: a > $o,X1: a] :
( ( ( X0 @ ( sK4 @ ( sK3 @ X0 ) ) )
!= $true )
| ( $true
= ( sK1 @ ( sK3 @ X0 ) ) )
| ( ( X0 @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
! [X0: a > $o,X1: a] :
( ( $true != $true )
| ( $true
= ( sK1 @ ( sK3 @ X0 ) ) )
| ( ( X0 @ ( sK4 @ ( sK3 @ X0 ) ) )
!= $true )
| ( ( X0 @ X1 )
!= $true ) ),
inference(superposition,[],[f17,f16]) ).
thf(f16,plain,
! [X7: a] :
( ( ( sK0 @ ( sK4 @ X7 ) @ X7 )
= $true )
| ( ( sK1 @ X7 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f17,plain,
! [X3: a > $o,X6: a,X5: a] :
( ( ( sK0 @ X5 @ ( sK3 @ X3 ) )
!= $true )
| ( $true
!= ( X3 @ X6 ) )
| ( ( X3 @ X5 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f15,plain,
! [X7: a] :
( ( $true
!= ( sK1 @ ( sK4 @ X7 ) ) )
| ( ( sK1 @ X7 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV382^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:53:19 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.JQ538Qcd0o/Vampire---4.8_31193
% 0.15/0.39 % (31390)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.39 % (31385)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.39 % (31386)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (31383)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.39 % (31384)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.39 % (31389)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.39 % (31387)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.39 % (31388)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.39 % (31386)Instruction limit reached!
% 0.15/0.39 % (31386)------------------------------
% 0.15/0.39 % (31386)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (31386)Termination reason: Unknown
% 0.15/0.39 % (31386)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (31386)Memory used [KB]: 5500
% 0.15/0.39 % (31386)Time elapsed: 0.004 s
% 0.15/0.39 % (31386)Instructions burned: 2 (million)
% 0.15/0.39 % (31386)------------------------------
% 0.15/0.39 % (31386)------------------------------
% 0.15/0.39 % (31390)Instruction limit reached!
% 0.15/0.39 % (31390)------------------------------
% 0.15/0.39 % (31390)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (31390)Termination reason: Unknown
% 0.15/0.39 % (31390)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (31390)Memory used [KB]: 5500
% 0.15/0.39 % (31390)Time elapsed: 0.005 s
% 0.15/0.39 % (31390)Instructions burned: 3 (million)
% 0.15/0.39 % (31390)------------------------------
% 0.15/0.39 % (31390)------------------------------
% 0.15/0.39 % (31385)Refutation not found, incomplete strategy
% 0.15/0.39 % (31385)------------------------------
% 0.15/0.39 % (31385)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (31385)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (31385)Memory used [KB]: 5500
% 0.15/0.39 % (31385)Time elapsed: 0.004 s
% 0.15/0.39 % (31385)Instructions burned: 2 (million)
% 0.15/0.39 % (31385)------------------------------
% 0.15/0.39 % (31385)------------------------------
% 0.15/0.39 % (31387)Instruction limit reached!
% 0.15/0.39 % (31387)------------------------------
% 0.15/0.39 % (31387)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (31387)Termination reason: Unknown
% 0.15/0.40 % (31387)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (31387)Memory used [KB]: 895
% 0.15/0.40 % (31387)Time elapsed: 0.004 s
% 0.15/0.40 % (31387)Instructions burned: 2 (million)
% 0.15/0.40 % (31387)------------------------------
% 0.15/0.40 % (31387)------------------------------
% 0.15/0.40 % (31384)Instruction limit reached!
% 0.15/0.40 % (31384)------------------------------
% 0.15/0.40 % (31384)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (31384)Termination reason: Unknown
% 0.15/0.40 % (31384)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (31384)Memory used [KB]: 5500
% 0.15/0.40 % (31384)Time elapsed: 0.007 s
% 0.15/0.40 % (31384)Instructions burned: 4 (million)
% 0.15/0.40 % (31384)------------------------------
% 0.15/0.40 % (31384)------------------------------
% 0.21/0.41 % (31389)Instruction limit reached!
% 0.21/0.41 % (31389)------------------------------
% 0.21/0.41 % (31389)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (31389)Termination reason: Unknown
% 0.21/0.41 % (31389)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (31389)Memory used [KB]: 5628
% 0.21/0.41 % (31389)Time elapsed: 0.018 s
% 0.21/0.41 % (31389)Instructions burned: 18 (million)
% 0.21/0.41 % (31389)------------------------------
% 0.21/0.41 % (31389)------------------------------
% 0.21/0.41 % (31388)First to succeed.
% 0.21/0.41 % (31397)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on Vampire---4 for (2999ds/1041Mi)
% 0.21/0.41 % (31394)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.21/0.41 % (31395)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.21/0.41 % (31388)Refutation found. Thanks to Tanya!
% 0.21/0.41 % SZS status Theorem for Vampire---4
% 0.21/0.41 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.41 % (31388)------------------------------
% 0.21/0.41 % (31388)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (31388)Termination reason: Refutation
% 0.21/0.41
% 0.21/0.41 % (31388)Memory used [KB]: 5628
% 0.21/0.41 % (31388)Time elapsed: 0.021 s
% 0.21/0.41 % (31388)Instructions burned: 16 (million)
% 0.21/0.41 % (31388)------------------------------
% 0.21/0.41 % (31388)------------------------------
% 0.21/0.41 % (31382)Success in time 0.031 s
% 0.21/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------